Regular Expressions: New Results and Open Problems
نویسندگان
چکیده
Regular expressions have been studied for nearly 50 years, yet many intriguing problems about their descriptive capabilities remain open. In this paper we sketch some new results and discuss what remains to be solved.
منابع مشابه
Compressed membership problems revisited
Membership problems for compressed strings in regular languages are investigated. Strings are represented by straight-line programs, i.e. contextfree grammars that generate exactly one string. For the representation of regular languages, various formalisms with different degrees of succinctness (e.g. suitably extended regular expressions, hierarchical automata) are considered. Precise complexit...
متن کاملCompressed Membership Problems for Regular Expressions and Hierarchical Automata
Membership problems for compressed strings in regular languages are investigated. Strings are represented by straight-line programs, i.e., context-free grammars that generate exactly one string. For the representation of regular languages, various formalisms with different degrees of succinctness (e.g., suitably extended regular expressions, hierarchical automata) are considered. Precise comple...
متن کامل$r$-fuzzy regular semi open sets in smooth topological spaces
In this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. By using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. Also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. Moreover, we investigate the ...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملChecking Determinism of Regular Expressions with Counting
We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|ΣE ||E|) time algorithm to check whether an expression E with counting is strongly deterministic where ΣE is the set of distinct symbols in E. It improves the previous upper bound of O(|E|) time on the same decision problems for both standard regular expressions and regular exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 2002